#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=5e3+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],b[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   for(LL i=1;i<=n;i++) cin>>a[i];
   for(LL i=1;i<=n;i++) cin>>b[i];
   LL ans=0;
   for(LL i=1;i<=n;i++) ans+=a[i]*b[i];
   LL res=0;
   for(LL i=1;i<=n;i++){
       LL cnt=0;LL mxv=0;
       for(LL j=1;j<=n;j++){
           LL x=i-j;
           LL y=i+j;
           if(x<1||y>n) break;
           cnt+=(b[y]-b[x])*(a[x]-a[y]);
           mxv=max(mxv,cnt);
       }
       res=max(res,mxv);
   }
   for(LL i=1;i<=n;i++){
       LL tot=0;LL mxv=0;
       for(LL j=1;j<=n;j++){
          LL x=i-j+1;
          LL y=i+j;
          if(x<1||y>n) break;
          tot+=(b[y]-b[x])*(a[x]-a[y]);
          mxv=max(mxv,tot);
       }
       res=max(res,mxv);
   }
   cout<<ans+res<<"\n";
   return 0;
}
